Bounds on the order of biregular graphs with even girth at least 8
نویسندگان
چکیده
Let 2 ≤ r < m and g ≥ 4 even be three positive integers. A graph with a degree set {r,m}, girth g and minimum order is called a bi-regular cage or an ({r,m}; g)-cage, and its order is denoted by n({r,m}; g). In this paper we obtain constructive upper bounds on n({r,m}; g) for some values of r,m and even girth at least 8.
منابع مشابه
Bounds for graphs of given girth and generalized polygons
In this paper we present a bound for bipartite graphs with average bidegrees η and ξ satisfying the inequality η ≥ ξ, α ≥ 1. This bound turns out to be the sharpest existing bound. Sizes of known families of finite generalized polygons are exactly on that bound. Finally, we present lower bounds for the numbers of points and lines of biregular graphs (tactical configurations) in terms of their b...
متن کاملOn the Extremal Regular Directed Graphs without Commutative Diagrams and Their Applications in Coding Theory and Cryptography
We use term regular directed graph (r. d. g.) for the graph of irreflexive binary relation with the constant number outputs (or inputs) for each vertex. The paper is devoted to studies of maximal size ER(d, v) of r. d. g. of order v without commutative diagrams formed by two directed passes of length < d with the common starting and ending points. We introduce the upper bound for ER(d, v), whic...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملBiregular Cages of Girth Five
Let 2 6 r < m and g be positive integers. An ({r,m}; g)–graph (or biregular graph) is a graph with degree set {r,m} and girth g, and an ({r,m}; g)–cage (or biregular cage) is an ({r,m}; g)–graph of minimum order n({r,m}; g). If m = r+1, an ({r,m}; g)–cage is said to be a semiregular cage. In this paper we generalize the reduction and graph amalgam operations from [M. Abreu, G. Araujo–Pardo, C. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 40 شماره
صفحات -
تاریخ انتشار 2013